Fast Gröbner Basis Computation for Boolean Polynomials
نویسندگان
چکیده
We introduce the Macaulay2 package BooleanGB, which computes a Gröbner basis for Boolean polynomials using a binary representation rather than symbolic. We compare the runtime of several Boolean models from systems in biology and give an application to Sudoku.
منابع مشابه
PolyBoRi: A framework for Gröbner-basis computations with Boolean polynomials
This work presents a new framework for Gröbner basis computations with Boolean polynomials. Boolean polynomials can be modelled in a rather simple way, with both coefficients and degree per variable lying in {0, 1}. The ring of Boolean polynomials is, however, not a polynomial ring, but rather the quotient ring of the polynomial ring over the field with two elements modulo the field equations x...
متن کاملPOLYBORI: A Gröbner Basis Framework for Boolean Polynomials
This work presents a new framework for Gröbner basis computations with Boolean polynomials. Boolean polynomials can be modeled in a rather simple way, with both coefficients and degree per variable lying in {0, 1}. The ring of Boolean polynomials is, however, not a polynomial ring, but rather the quotient ring of the polynomial ring over the field with two elements modulo the field equations x2...
متن کاملOn implementing the symbolic preprocessing function over Boolean polynomial rings in Gröbner basis algorithms using linear algebra
Linear algebra is introduced by Faugère in F4 to speed up the reduction procedure during Gröbner basis computations. Linear algebra has also been used in fast implementations of F5 and other signature-based Gröbner basis algorithms. To use linear algebra for reductions, an important step is constructing matrices from critical pairs and existing polynomials by the Symbolic Preprocessing function...
متن کاملCombinations of Boolean Gröbner Bases and SAT Solvers
In this thesis, we combine Gröbner basis with SAT Solver in different manners. Both SAT solvers and Gröbner basis techniques have their own strength and weakness. Combining them could fix their weakness. The first combination is using Gröbner techniques to learn additional binary clauses for SAT solver from a selection of clauses. This combination is first proposed by Zengler and Küchlin. Howev...
متن کاملBoolean Gröbner Basis Reductions on Datapath Circuits Using the Unate Cube Set Algebra
Recent developments in formal datapath verification make efficient use of symbolic computer algebra algorithms for formal verification. The circuit is modeled as a set of polynomials over Boolean (or pseudo-Boolean) rings, and Gröbner basis (GB) reductions are performed over these polynomials to derive a canonical representation. GB reductions of Boolean polynomials tend to cause intermediate e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1010.2669 شماره
صفحات -
تاریخ انتشار 2010